A Novel and Efficient Anti-Collision Protocol for RFID Tag Identification
نویسندگان
چکیده
Radio frequency identification (RFID) is prominent technology for fast object identification and tracking. In RFID systems, reader-to-reader or tag-to-tag collisions are common. Majority of probabilistic and deterministic anticollisions methods are inefficient in channel distribution and improving the performance. In this work, simulation annealing based anti-collision protocol is proposed where there is uniform distribution of channels among readers. In addition, preference is given to tag state parameters over fixed scheduling in order to increase the performance. The tag state parameters named energy efficiency, distance from selected reader and distance from obstacles are considered. The simulation results show that the proposed approach is an effective mechanism where there is a minimum improvement of 16.7% for 100 readers and maximum of 32.7% for 1000 readers in tag identification ratio, and a minimum improvement of 23% for 1000 readers and maximum of 75.3% for 100 readers in total successful interrogation cycles. Further, total time cycles, total IDLE cycles, total number of collisions, delay, and total number of packets sent and received are reduced compared to state-of-art protocols. It is observed that the proposed simulation annealing based protocol is contiguous channels allocation algorithm with zero collision. Keywords—RFID; anti-collision; simulated annealing; performance; tag-to-tag collisions; reader-to-reader collisions
منابع مشابه
An Efficient and Reliable Tree-based Anti-collision Protocol for RFID Systems with Capture Effect
In radio frequency identification (RFID) systems, if tags transmit their IDs simultaneously, a reader cannot correctly identify the IDs due to collision and the performance of RFID systems degrades by the collision. So, anti-collision protocols to reduce the number of collisions are required. The binary tree anti-collision protocol branches randomly in a tree to reduce collisions in the next id...
متن کاملImprovement of Anti-Collision Performance for the ISO 18000-6 Type B RFID System
This paper proposes a novel method to suppress tag collision in the ISO 18000-6 type B protocol which is one of the standard protocols of UHF RFID systems. The anti-collision performance in terms of the total identification time is improved by reducing the length of bits and the number of transmission commands required for multi-tag identification in the ISO 18000-6 type B protocol. Simulation ...
متن کاملEfficient Novel Anti-collision Protocols for Passive RFID Tags
In this paper we discuss how to reduce identification time with a given number of tags in the field of an RFID reader. This paper proposes three methods for fast tag identification: bi-slotted tree based RFID tag anti-collision protocols, query tree based reservation, and the combining method of them. Theses proposed methods can be used for enhancing the identification speed of RFID systems.
متن کاملA Time - Optimal Anti - collision Algorithm for FSA - Based RFID Systems
© 2011 ETRI Journal, Volume 33, Number 3, June 2011 With the introduction of the new generation RFID technology, EPCglobal Class-1 Generation-2, there is considerable interest in improving the performance of the framed slotted Aloha (FSA)-based tag collision arbitration protocol. We suggest a novel time-optimal anti-collision algorithm for the FSA protocol. Our performance evaluation demonstrat...
متن کاملA Novel Approach for ID Distribution Problem in Tree-Based Tag Anti-Collision Protocols of RFID Systems
Tag collision is one of the most important issues in RFID systems and many tag anti-collision protocols were proposed in literature. But some kind of these protocols like Tree-based protocols (specifically Query tree) which its performance depends on tag ID length and construction, have some issues like ID distribution. In this paper we discuss about Query tree protocol which may influenced by ...
متن کامل